Capacity Definitions and Coding Strategies for General Channels with Receiver Side Information - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
نویسنده
چکیده
We consider three capacity definitions for a channel with channel side information at t h e receiver. T h e capacity is the highest rate asymptotically achievable. T h e outage capacity is t h e highest rate asymptotically achievable with a given probability of decoder-recognized outage. The expected capacity is t h e highest expected rate asymptotically achievable using a single encoder a n d multiple decoders, where side information at the decoder determines which code to use. We motivate t h e la t ter definitions using t h e concept of maximizing reliably received rate. A coding theorem is given for each capacity.
منابع مشابه
Capacity Definitions for General Channels with Receiver Side Information
We consider three capacity definitions for general channels with channel side information at the receiver, where the channel is modeled as a sequence of finite dimensional conditional distributions not necessarily stationary, ergodic, or information stable. The Shannon capacity is the highest rate asymptotically achievable with arbitrarily small error probability. The capacity versus outage is ...
متن کاملCapacity of Channels with Uncoded-Message Side-Information - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Abstrac t Parallel independent channels where no encoding is allowed for one of the channels are studied. The Slepian-Wolf theorem on source coding of correlated sources is used t o show that any information source whose entropy rate is below the sum of the capacity of the coded channel and the input/output mutual information of the uncoded channel is transmissible with arbitrary reliability. T...
متن کاملRobust Decoding for Non-Gaussian CDMA and Non-Exponential Timing Channels - Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
The capacity region of the two-user Gaussian CDMA channel is shown to be achievable when the (stationary, ergodic) noise is not Gaussian, using a decoder matched to the Gaussian distribution. Similarly, the capacity of the exponential server timing channel is shown to be achievable when the service distribution is not exponential, using a decoder matched to the exponential distribution. The cod...
متن کاملFast Iterative Coding Techniques for Feedback Channels
A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noiseless feedback. Algorithms for encoding and decoding that require computations growing linearly with the number of channel inputs used are developed. The error exponent associated with the scheme is shown to be optimal and implies...
متن کاملThe Compound Channel Capacity of a Class of Finite-State Channels
A transmitter and receiver need to be designed to guarantee reliable communication on any channel belonging to a given family of finite-state channels defined over common finite input, output, and state alphabets. Both the transmitter and receiver are assumed to be ignorant of the channel over which transmission is carried out and also ignorant of its initial state. For this scenario we derive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004